The Independence of Peano ' s Fourth Axiom fromMartin - L of ' s Type Theory without
نویسنده
چکیده
منابع مشابه
On the Natural Order Relation in Peano Algebras with Finitary or Infinitary Operations
Most work on infinitary algebras in the literature makes ample use of the axiom of choice AC (see, e.g., [10],[12],[14]). While the theory of arbitrary infinitary algebras can hardly be developed in a satisfactory manner without AC, in the case of Peano algebras (= word algebras, absolutely free algebras) many or even most of the basic results can be proved in Zermelo-Fraenkel set theory ZF wit...
متن کاملComputational Complexity on Signed Numbers
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of natural numbers is not essential. It claims that natural numbers remain usable in traditional ways without assuming the existence of at least one natural number....
متن کاملOn Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملNominalistic Logic (Extended Abstract)
Nominalistic Logic (NL) is a new presentation of Paul Gilmore’s Intensional Type Theory (ITT) as a sequent calculus together with a succinct nominalization axiom (N) that permits names of predicates as individuals in certain cases. The logic has a flexible comprehension axiom, but no extensionality axiom and no infinity axiom, although axiom N is the key to the derivation of Peano’s postulates ...
متن کاملEssential Incompleteness of Arithmetic Verified by Coq
A constructive proof of the Gödel-Rosser incompleteness theorem [9] has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive functions is given, and all primitive recursive functions are proved to be representable in a weak axiom system. Formulas and proofs are encoded as natural n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988